Optimisation Approaches to Constraint Satisfaction Problems in Computer Vision

نویسنده

  • Kazuhiko Yamamoto
چکیده

This paper describes several new image understanding methods based on parallel operation. There are several constraint satisfaction approaches using a energy minimization. We show how we reconstruct three dimensional surfaces from contours without elevation data and sparse points of known elevation data by using this approach. We also introduce Active Net using this approach and apply this model to segmentation and binocular stereo matching . We experimented with these energy minimization approaches to solve the problems of early and intermediate level of computer vision and show some of the results of our recent research.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classes of Submodular Constraints Expressible by Graph Cuts ∗ Stanislav

Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the theory of combinatorial optimisation, that instances of VCSPs with submodular constraints can be minimised in polynomial time. However, the general algorithm is of order O(n) and hence rather impractical. In this paper...

متن کامل

Algorithms for Constraint-Satisfaction Problems: A Survey

A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, and the satisfiability problem. A number of different approaches have been developed for solving th...

متن کامل

The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms

This paper describes a novel method for attacking constrained optimisation problems with evolutionary algorithms, and demonstrates its effectiveness over a range of problems. COMOGA (Constrained Optimisation by MultiObjective Genetic Algorithms) combines two evolutionary techniques for multiobjective optimisation with a simple regulatory mechanism to produce a constrained optimisation method. I...

متن کامل

A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems

We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...

متن کامل

Software ENgineering A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems

We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994